On-line algorithm for scheduling parallel tasks on a group of related clusters
نویسندگان
چکیده
منابع مشابه
A Novel, Energy-Aware Task Duplication-Based Scheduling Algorithm of Parallel Tasks on Clusters
Increasing energy has become an important issue in high performance clusters. To balance the energy and performance, we proposed a novel, energy-aware duplication-based scheduling (NEADS). An existing energy-aware duplication-based algorithm replicates all qualified predecessor tasks in a bottom-up manner. Some tasks without direct relation may be replicated to the same processor, which cannot ...
متن کاملAn Energy-aware Dynamic Clustering-based Scheduling Algorithm for Parallel tasks on Clusters
The paper proposes an energy-aware dynamic clustering-based scheduling algorithm that aims at reducing communication energy consumption through clustering dependent tasks. A job can be described by a direct acyclic graph (DAG) of parallel tasks. Because the execution time is hard to estimate accurately, the current static scheduling strategies may cause energy increase due to task waiting. The ...
متن کاملAn Asymptotically Optimal On-Line Algorithm for Parallel Machine Scheduling
| Jobs arriving over time must be nonpreemptively processed on one of m parallel machines, each of which running at its own speed, so as to minimize a weighted sum of the job completion times. In this on-line environment, the processing requirement and weight of a job are not known before the job arrives. The Weighted Shortest Processing Requirement (WSPR) on-line heuristic is a simple extensio...
متن کاملScheduling Tasks Sharing Files on Heterogeneous Clusters
This paper is devoted to scheduling a large collection of independent tasks onto heterogeneous clusters. The tasks depend upon (input) files which initially reside on a master processor. A given file may well be shared by several tasks. The role of the master is to distribute the files to the processors, so that they can execute the tasks. The objective for the master is to select which file to...
متن کاملA QoS-Based Self-Adaptive Scheduling Algorithm for Real-Time Tasks on Heterogeneous Clusters
Nowadays, providing quality of service (QoS) guarantees for some applications such as signal data processing has become a critical issue. In this paper, we propose a novel QoS-based self-adaptive scheduling algorithm called QBSA that sufficiently considers the adaptability for realtime tasks with QoS demands on heterogeneous clusters. When the system is in heavy load, the QBSA algorithm can deg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Institute for System Programming of RAS
سال: 2012
ISSN: 2079-8156,2220-6426
DOI: 10.15514/ispras-2012-23-27